Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry
نویسنده
چکیده
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls and polytopes), they lead to interesting and difficult problems from real algebraic geometry. Namely, it is necessary to characterize and compute the common tangent lines to a given set of convex bodies. In particular, we present a new sweep algorithm in dimension 2, as well as survey and extend recent algebraic-geometric results on the tangent problems
منابع مشابه
Telling convex from reflex allows to map a polygon
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along edges of the visibility graph of P. The visibility graph has a vertex for every vertex of P and an edge between two vertices if they see each other, i.e. if the line segment connecting them lies inside P entirely. While located at a vertex, the robot is capable of ordering the vertices it sees in...
متن کاملAlgebraic Moments – Real Root Finding and Related Topics –
Polynomial root finding is a classical and well studied problem in mathematics with practical applications in many areas. Various relevant questions can be reformulated into the task of finding all common roots of a given system of polynomials in several variables, the so-called algebraic variety or zero set. Traditionally, root finding algorithms are implemented in exact arithmetics over algeb...
متن کاملAlgebraic algorithms and applications to geometry
Real algebraic numbers are the real numbers that are real roots of univariate polynomials with integer coefficients. We study exact algorithms, from a theoretical and an implementation point of view, that are based on integer arithmetic of arbitrary precision, for computations with real algebraic numbers and applications of these algorithms on problems and algorithms in non linear computational...
متن کاملComputations with real algebraic numbers of degree up to 4
Our motivation comes from computer-aided design and geometric modeling, where algorithms and predicates rely on computations of real algebraic numbers (usually of small degree). Predicates must be decided exactly in all cases, including degeneracies. In computational geometry there is a growing need for robust manipulation of curved objects (see [2] for a modern approach), since the critical po...
متن کاملHarnessing the power of GPUs for problems in real algebraic geometry
This thesis presents novel parallel algorithms to leverage the power of GPUs (Graphics Processing Units) for exact computations with polynomials having large integer coefficients. The significance of such computations, especially in real algebraic geometry, is hard to undermine. On massively-parallel architectures such as GPU, the degree of datalevel parallelism exposed by an algorithm is the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001